Multiple alignment analysis based on hidden markov models 基于隱馬爾可夫模型的多重序列分析
Homology analysis by local blast and multiple alignment showed that these clones represented 1 651 unique transcripts 通過本地blast和序列多重對齊分析,從這些序列得到1651個獨(dú)立的序列。
To deal with the question that how we can guarantee the dna sequences which are stored in the personal dna database are anonymous , that no one can find out whom a special dna sequence is collected from , this paper get a new method ? savior , by improve dnala ( dna lattice anonymization ) , which is a method settling this question . savior replaces the multiple alignment in dnala with pairwise alignment between every tow sequences , and replaces the greedy algorithm in dnala with stochastic hill - climbing . for doing this , it can save the time for data pretreatment , and add the precision of classing 針對個人dna數(shù)據(jù)的隱私保護(hù)問題,即:如何保證無法將存儲在數(shù)據(jù)庫中的dna序列信息與其提供者的個人身份信息(如:姓名,身份證號碼等)聯(lián)系起來,本文對一種新近開發(fā)的隱私保護(hù)方法? dnala ( dnalatticeanonymization )進(jìn)行了改進(jìn),在數(shù)據(jù)預(yù)處理階段,用兩兩雙序列比對代替了原算法中的多序列比對,在不降低處理精度的情況下減少了數(shù)據(jù)預(yù)處理所耗費(fèi)的時間;用隨機(jī)爬山法代替了原算法中的貪心策略,增加了算法后期處理的精度,從而形成了一種新的算法? savior 。